import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.Scanner;

public class demo11 {
    public static void main1(String[] args) {
        Scanner in = new Scanner(System.in);
        int a = in.nextInt(), b =in.nextInt();
        int x = 0;
        PriorityQueue<Integer> heap = new PriorityQueue<>(new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return o1 - o2;
            }
        });
        for (; x <= a*b;x++){
            if ((x% a== 0) && (x %b == 0)){
                heap.add(x);
            }
        }
        heap.poll();
        System.out.println(heap.poll());
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int a = in.nextInt(), b =in.nextInt();
        System.out.println(a*b / gcd(a,b));
    }

    private static int gcd(int a, int b) {
        if (b == 0) return a;
        return gcd(b,(a%b));

    }


}
